Approximating Vector Scheduling: Almost Matching Upper and Lower Bounds
نویسندگان
چکیده
منابع مشابه
Lower Bounds for Approximating the Matching Polytope
We prove that any extended formulation that approximates the matching polytope on nvertex graphs up to a factor of (1 + ε) for any 2 n ≤ ε ≤ 1 must have at least ( n α/ε ) defining inequalities where 0 < α < 1 is an absolute constant. This is tight as exhibited by the (1 + ε) approximating linear program obtained by dropping the odd set constraints of size larger than (1 + ε)/ε from the descrip...
متن کاملApproximating Spanners and Directed Steiner Forest: Upper and Lower Bounds
It was recently found that there are very close connections between the existence of additive spanners (subgraphs where all distances are preserved up to an additive stretch), distance preservers (subgraphs in which demand pairs have their distance preserved exactly), and pairwise spanners (subgraphs in which demand pairs have their distance preserved up to a multiplicative or additive stretch)...
متن کاملNew Lower Bounds for Matching Vector Codes
A Matching Vector (MV) family modulo m is a pair of ordered lists U = (u1, . . . , ut) and V = (v1, . . . , vt) where ui, vj ∈ Znm with the following inner product pattern: for any i, 〈ui, vi〉 = 0, and for any i 6= j, 〈ui, vj〉 6 = 0. A MV family is called q-restricted if inner products 〈ui, vj〉 take at most q different values. Our interest in MV families stems from their recent application in t...
متن کاملUpper and lower bounds of symmetric division deg index
Symmetric Division Deg index is one of the 148 discrete Adriatic indices that showed good predictive properties on the testing sets provided by International Academy of Mathematical Chemistry. Symmetric Division Deg index is defined by $$ SDD(G) = sumE left( frac{min{d_u,d_v}}{max{d_u,d_v}} + frac{max{d_u,d_v}}{min{d_u,d_v}} right), $$ where $d_i$ is the degree of vertex $i$ in graph $G$. In th...
متن کاملUpper and lower bounds for numerical radii of block shifts
For an n-by-n complex matrix A in a block form with the (possibly) nonzero blocks only on the diagonal above the main one, we consider two other matrices whose nonzero entries are along the diagonal above the main one and consist of the norms or minimum moduli of the diagonal blocks of A. In this paper, we obtain two inequalities relating the numeical radii of these matrices and also determine ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Algorithmica
سال: 2016
ISSN: 0178-4617,1432-0541
DOI: 10.1007/s00453-016-0116-0